Generalized Secret Sharing using Permutation Ordered Binary System

نویسندگان

  • V. P. Binu
  • A. Sreekumar
چکیده

Secret sharing is a method of dividing a secret among n participants and allows only qualified subset to reconstruct the secret and hence provides better reliability and availability of secret data.In the generalized secret sharing scheme, a monotone access structure of the set of participants is considered. The access structure specifies a qualified subset of participants who can reconstruct the secret from their shares.Generalized secret sharing schemes can be efficiently implemented by using (n, n) scheme.We have developed an efficient (n, n) scheme using Permutation Ordered Binary (POB) number system which is then combined with cumulative arrays to obtain a generalized secret sharing scheme.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

A Secure Block Permutation Image Steganography Algorithm

Steganography is the art of hiding confidential information (secret) within any media file (cover media) to produce an amalgamated secret-cover media called stego media, so that the secret cannot be recognized or recovered by unauthorized recipients. Many steganalysis techniques have been developed enabling recognition of the existence of secrets within stego media and recovering it. Therefore,...

متن کامل

A 2 out of 3 Visual Multiple Secret Sharing Method using Generalized Random Grids

Visual secret sharing by using generalized random grids is a novel approach for generating nonexpansible shares by artfully utilizing various random variables. Stacking the shares together, secret image can be revealed. This paper proposes a 2 out of 3 visual multiple secret sharing method using generalized random grids. Three secret images (A, B, C) are used for generating three non-expansible...

متن کامل

Ideal Contrast Secret Sharing Scheme through Meaningful Shares with Enveloping Digital Watermarking using Bit Plane based (k,n)-VCS

Visual Cryptography Scheme (VCS) is an encryption method that works on human visual system. It encrypts a secret image into n shares and decryption can be done only by stacking k or more share images without any computation. A new secret sharing scheme with meaningful shares using (k,n)-threshold visual cryptography and digital watermarking for grayscale images based on bit plane encoding is pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1407.3609  شماره 

صفحات  -

تاریخ انتشار 2014